A Gradient-like Algorithm for Decentralized Formation Control
نویسنده
چکیده
In this paper, we investigate a decentralized formation control algorithm for an undirected formation control model. Unlike other formation control problems where only the shape of a configuration counts, we emphasize here also its Euclidean embedding. By following this decentralized formation control law, the agents will converge to certain equilibrium of the control system. In particular, we show that there is a quadratic Lyapunov function associated with the formation control system whose unique local (global) minimum point is the target configuration. In view of the fact that there exist multiple equilibria (in fact, a continuum of equilibria) of the formation control system, and hence there are solutions of the system which converge to some equilibria other than the target configuration, we apply simulated annealing, as a heuristic method, to the formation control law to fix this problem. Simulation results show that sample paths of the modified stochastic system approach the target configuration.
منابع مشابه
A Proximal Gradient Algorithm for Decentralized Composite Optimization over Directed Networks
This paper proposes a fast decentralized algorithm for solving a consensus optimization problem defined in a directed networked multi-agent system, where the local objective functions have the smooth+nonsmooth composite form, and are possibly nonconvex. Examples of such problems include decentralized compressed sensing and constrained quadratic programming problems, as well as many decentralize...
متن کاملCounting Critical Formations on a Line
Formation shape control for a collection of point agents is concerned with devising decentralized control laws which ensure that the formation will move so that certain interagent distances approximate prescribed values as closely as possible. Such laws are often derived using steepest descent of a potential function which is invariant under translation and rotation, and then critical formation...
متن کاملCooperative Control of Multiple Quadrotors for Transporting a Common Payload
This paper investigates the problem of controlling a team of Quadrotors that cooperatively transport a common payload. The main contribution of this study is to propose a cooperative control algorithm based on a decentralized algorithm. This strategy is comprised of two main steps: the first one is calculating the basic control vectors for each Quadrotor using Moore–Penrose theory aiming at coo...
متن کاملOptimizing decentralized production–distribution planning problem in a multi-period supply chain network under uncertainty
Decentralized supply chain management is found to be significantly relevant in today’s competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final produc...
متن کاملA passivity-based decentralized strategy for generalized connectivity maintenance
The design of decentralized controllers coping with the typical constraints on the inter-robot sensing/communication capabilities represents a promising direction in multi-robot research thanks to the inherent scalability and fault tolerance of these approaches. In these cases, connectivity of the underlying interaction graph plays a fundamental role: it represents a necessary condition for all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1412.6726 شماره
صفحات -
تاریخ انتشار 2014